Kotzig frames and circuit double covers

نویسندگان

  • Xiaodong Zhang
  • Cun-Quan Zhang
چکیده

A cubic graph H is called a Kotzig graph if H has a circuit double cover consisting of three Hamilton circuits. It was first proved by Goddyn that if a cubic graph G contains a spanning subgraph H which is a subdivision of a Kotzig graph then G has a circuit double cover. A spanning subgraph H of a cubic graph G is called a Kotzig frame if the contracted graph G/H is even and every non-circuit component of H is a subdivision of a Kotzig graph. It was conjectured by Häggkvist and Markström (Kotzig Frame Conjecture, JCTB 2006) that if a cubic graph G contains a Kotzig frame, then G has a circuit double cover. This conjecture was verified for some special cases: it is proved by Goddyn if a Kotzig frame has only one component, by Häggkvist and Markström (JCTB 2006) if a Kotzig frame has at most one noncircuit component. In this paper, the Kotzig Frame Conjecture is further verified for some families of cubic graphs with Kotzig frames H of the following types: (i) a Kotzig frame H has at most two components; or (ii) the contracted graph G/H is a tree if parallel edges are identified as a single edge. The first result strengthens the theorem by Goddyn. The second result is a further generalization of the first result, and is a partial result to the Kotzig Frame Conjecture for frames with multiple Kotzig components. © 2011 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cycle double covers and the semi-Kotzig frame

Let H be a cubic graph admitting a 3-edge-coloring c : E(H) → Z3 such that the edges colored with 0 and μ ∈ {1, 2} induce a Hamilton circuit of H and the edges colored with 1 and 2 induce a 2-factor F . The graph H is semi-Kotzig if switching colors of edges in any even subgraph of F yields a new 3-edge-coloring ofH having the same property as c . A spanning subgraphH of a cubic graph G is call...

متن کامل

Cycle Double Covers of Graphs with Disconnected Frames

Continuing work initiated by Häggkvist and Markström, we show in this paper that certain disconnected frames guarantee the existence of a cycle double cover. Specifically, we show that the disjoint union of a Kotzig and a sturdy graph forms a good frame.

متن کامل

Cycle double covers and spanning minors I

Define a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which each pair of colours form a Hamiltonian cycle. We show that every cubic graph with spanning subgraph consisting of a subdivision of a Kotzig graph together with even cycles has a cycle double cover, in fact a 6-CDC. We prove this for two other families of graphs similar to Kotzig graphs as well. In parti...

متن کامل

Uniformities and covering properties for partial frames (II)

This paper is a continuation of [Uniformities and covering properties for partial frames (I)], in which we make use of the notion of a partial frame, which is a meet-semilattice in which certain designated subsets are required to have joins, and finite meets distribute over these. After presenting there our axiomatization of partial frames, which we call $sels$-frames, we added structure, in th...

متن کامل

Design of a Single-Layer Circuit Analog Absorber Using Double-Circular-Loop Array via the Equivalent Circuit Model

A broadband Circuit Analogue (CA) absorber using double-circular-loop array is investigated in this paper. A simple equivalent circuit model is presented to accurately analyze this CA absorber. The circuit simulation of the proposed model agrees well with full-wave simulations. Optimization based the equivalent circuit model, is applied to design a single-layer circuit analogue absorber using d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 312  شماره 

صفحات  -

تاریخ انتشار 2012